Spanning Trees of Bounded Degree
نویسندگان
چکیده
Dirac’s classic theorem asserts that if G is a graph on n vertices, and δ(G) ≥ n/2, then G has a hamilton cycle. As is well known, the proof also shows that if deg(x) + deg(y) ≥ (n− 1), for every pair x, y of independent vertices in G, then G has a hamilton path. More generally, S. Win has shown that if k ≥ 2, G is connected and ∑ x∈I deg(x) ≥ n− 1 whenever I is a k-element independent set, then G has a spanning tree T with ∆(T) ≤ k. Here we are interested in the structure of spanning trees under the additional assumption that G does not have a spanning tree with maximum degree less than k. We show that apart from a single exceptional class of graphs, if ∑ x∈I deg(x) ≥ n − 1 for every k-element independent set, then G has a spanning caterpillar T with maximum degree k. Furthermore, given a maximum path P in G, we may require that P is the spine of T and that the set of all vertices whose degree in T is 3 or larger is independent in T. ∗Research supported in part by the National Security Agency. †Research supported in part by the National Science Foundation. THE ELECTRONIC JOURNAL OF COMBINATORICS 8 (2001), #R33 1
منابع مشابه
Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
In this paper, we present some new results describing connections between the spectrum of a regular graph and its generalized connectivity, toughness, and the existence of spanning trees with bounded degree.
متن کاملA Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
متن کامل
A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
متن کامل
Large Bounded Degree Trees in Expanding Graphs
A remarkable result of Friedman and Pippenger [4] gives a sufficient condition on the expansion properties of a graph to contain all small trees with bounded maximum degree. Haxell [5] showed that under slightly stronger assumptions on the expansion rate, their technique allows one to find arbitrarily large trees with bounded maximum degree. Using a slightly weaker version of Haxell’s result we...
متن کاملOn the extremal total irregularity index of n-vertex trees with fixed maximum degree
In the extension of irregularity indices, Abdo et. al. [1] defined the total irregu-larity of a graph G = (V, E) as irrt(G) = 21 Pu,v∈V (G) du − dv, where du denotesthe vertex degree of a vertex u ∈ V (G). In this paper, we investigate the totalirregularity of trees with bounded maximal degree Δ and state integer linear pro-gramming problem which gives standard information about extremal trees a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 8 شماره
صفحات -
تاریخ انتشار 2001